Перевод: с английского на все языки

со всех языков на английский

divisor chain

См. также в других словарях:

  • Chain hash table — This is a hash table implementation. Here collisions are handled by Chaining.The divisor used is 13. A double Array is used for implementation ie Array of pointers. 1 // Authors: Prerit Goel and Anant Sinha 2 #include 3 struct node 4 { 5 int… …   Wikipedia

  • Markov chain — A simple two state Markov chain. A Markov chain, named for Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized …   Wikipedia

  • Regular chain — In computer algebra, a regular chain is a particular kind of triangular set in a multivariate polynomial ring over a field. It enhances the notion of characteristic set. Introduction Given a linear system, one can convert it to a triangular… …   Wikipedia

  • International Rule (sailing) — The International Rule, also known as the Metre Rule, was created for the measuring and rating of yachts to allow different designs of yacht to race together under a handicap system. Prior to the ratification of the International Rule in 1907,… …   Wikipedia

  • Noetherian ring — In mathematics, more specifically in the area of modern algebra known as ring theory, a Noetherian ring, named after Emmy Noether, is a ring in which every non empty set of ideals has a maximal element. Equivalently, a ring is Noetherian if it… …   Wikipedia

  • Glossary of ring theory — Ring theory is the branch of mathematics in which rings are studied: that is, structures supporting both an addition and a multiplication operation. This is a glossary of some terms of the subject. Contents 1 Definition of a ring 2 Types of… …   Wikipedia

  • Aperiodic graph — In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer k > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths… …   Wikipedia

  • Extended Euclidean algorithm — The extended Euclidean algorithm is an extension to the Euclidean algorithm for finding the greatest common divisor (GCD) of integers a and b : it also finds the integers x and y in Bézout s identity: ax + by = gcd(a, b). ,(Typically either x or… …   Wikipedia

  • Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… …   Wikipedia

  • Unique factorization domain — In mathematics, a unique factorization domain (UFD) is, roughly speaking, a commutative ring in which every element, with special exceptions, can be uniquely written as a product of prime elements, analogous to the fundamental theorem of… …   Wikipedia

  • Bézout domain — In mathematics, a Bézout domain is an integral domain which is, in a certain sense, a non Noetherian analogue of a principal ideal domain. More precisely, a Bézout domain is a domain in which every finitely generated ideal is principal. A… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»